Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
391	Practical Affiliation-Hiding Authentication from Improved Polynomial Interpolation (Full Version? ) Mark Manulis and Bertram Poettering Cryptographic Protocols Group Department of Computer Science Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-12-28 06:35:09 Interpolation Polynomials Polynomial interpolation Polynomial Lagrange polynomial Time complexity Finite field Vandermonde matrix Mathematics Algebra Theoretical computer science
392	Multiparty Key Agreement using Bilinear Map Nam-Su Jho, Myung-Hwan Kim, Do Won Hong and Byung-Gil Lee ABSTRACT ⎯ A key agreement protocol is a cryptographical primitive which allows participants to share a common secre Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2007-12-17 20:17:06 Computer science Advantage Polynomial Time complexity Low Algorithm Applied mathematics Computational complexity theory Mathematics
393	Nearest Neighbor Search: the Old, the New, and the Impossible by Alexandr Andoni Submitted to the Department of Electrical Engineering and Computer Science Add to Reading List Source URL: www.mit.edu Language: English - Date: 2009-09-10 17:03:04 Theoretical computer science K-nearest neighbor algorithm Nearest neighbor search Algorithm Time complexity Locality-sensitive hashing Information science Mathematics Search algorithms
394	CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 27 May 2010 This question paper has 5 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10 Add to Reading List Source URL: www.cmi.ac.in Language: English - Date: 2011-04-04 11:42:17 Analysis of algorithms Algorithm Mathematical logic Time complexity Regular expression P Randomized algorithm Median graph Theoretical computer science Computational complexity theory Applied mathematics
395	Online Discovery of Top-k Similar Motifs in Time Series Data Hoang Thanh Lam1 , Ninh Dang Pham2 and Toon Calders1 1 Department of Math. and Computer Science Add to Reading List Source URL: www.itu.dk Language: English - Date: 2013-10-15 07:23:24 Search algorithms Analysis of algorithms K-nearest neighbor algorithm Time complexity Pi Algorithm Nearest neighbor search Euclidean algorithm Theoretical computer science Mathematics Applied mathematics
396	Unprovable Security of Two-Message Zero Knowledge Kai-Min Chung∗ Edward Lui∗ Mohammad Mahmoody∗ Rafael Pass∗ December 19, 2012 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-19 11:29:49 Complexity classes Cryptographic protocols Probabilistic complexity theory Interactive proof system Probabilistically checkable proof IP Soundness Zero-knowledge proof Time complexity Theoretical computer science Computational complexity theory Applied mathematics
397	Parameterized Complexity for the Database Theorist Martin Grohe Division of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK. Email: 1 . Introduction Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-07-04 06:02:43 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Graph coloring Dominating set FO Time complexity Tree decomposition Theoretical computer science Computational complexity theory Applied mathematics
398	Armadillo: a compilation chain for privacy preserving applications Sergiu Carpov, Paul Dubrulle, Renaud Sirdey CEA, LIST, Embedded Real Time & Security Laboratory, Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-10 03:12:34 Mathematics Logic in computer science Homomorphic encryption Computational complexity theory Boolean circuit Block cipher modes of operation Advanced Encryption Standard Circuit Block cipher Theoretical computer science Cryptography Applied mathematics
399	Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-10-24 15:11:43 Complexity classes Dynamic programming NP-complete problems Operations research P versus NP problem Time complexity Knapsack problem P Subset sum problem Theoretical computer science Computational complexity theory Applied mathematics
400	c 2009 International Press COMMUNICATIONS IN INFORMATION AND SYSTEMS Vol. 9, No. 4, pp, 2009 Add to Reading List Source URL: www.ims.cuhk.edu.hk Language: English - Date: 2009-11-16 19:28:18 Computational complexity theory Chordal graph Tree PP B-tree Time complexity Theoretical computer science Graph theory Applied mathematics

UPDATE